The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay) Second ERC Research period on Diophantine Geometry Cet

Source URL: www.math.u-psud.fr

From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen

Source URL: www.cs.uwm.edu

• Mathematics
• Mathematical analysis
• Diophantine approximation
• Low-discrepancy sequence
• Numerical analysis
• Quasirandomness
• Random number generation
• Ring
• Permutation
• Maximum disjoint set
• Permutation polynomial

The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay, visiting BICMR) Capital Normal University

Source URL: www.math.u-psud.fr

• Abstract algebra
• Algebra
• Geometry
• Algebraic geometry
• Algebraic varieties
• Projective geometry
• Smooth scheme
• Projective variety
• Field extension
• Elliptic curve
• Affine variety
• Morphism of algebraic varieties

ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa

Source URL: math.mit.edu

• Mathematics
• Mathematical analysis
• Algebra
• Polynomials
• Transcendental numbers
• Diophantine approximation
• Coding theory
• Algebraic function
• Elliptic curve

Recent results on Diophantine quintuples Alan Filipin Građevinski fakultet, Sveučilište u Zagrebu A set of m positive integers with the property that the product of any two of them increased by 1 is a perfect square i

Source URL: www.mathos.unios.hr

THEOREM OF THE DAY The DPRM Theorem Every recursively enumerable set is Diophantine. A set is recursively enumerable if there exists some (possibly non-terminating) algorithm which lists precisely the members of the set.

Source URL: www.theoremoftheday.org

A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension∗ Esther Ezra† Abstract Let (X, S) be a set system on an n-point set X. The discrepancy of S is defined as the minimum of the

Source URL: www.cims.nyu.edu

• Computational geometry
• Ε-net
• Big O notation
• Diophantine approximation
• Mathematics
• Theoretical computer science
• Mathematical analysis

Estimating a product of sines using Diophantine approximation Jordan Bell Department of Mathematics, University of Toronto April 3, 2014

Source URL: individual.utoronto.ca

• Measure theory
• Diophantine approximation
• Liouville number
• Measure
• Meagre set
• Transcendence theory
• Transcendental number
• Sigma-algebra
• Σ-finite measure
• Mathematics
• Mathematical analysis
• Descriptive set theory

Undecidability in Number Theory Bjorn Poonen D

Source URL: www.ams.org

• Group theory
• Field theory
• Computability theory
• Diophantine set
• Number theory
• Recursively enumerable set
• Polynomial
• Elliptic curve
• Finite field
• Mathematics
• Abstract algebra
• Diophantine equations

Recursion Theory Frank Stephan October 8, 2012 Recursion theory deals with the fundamental concepts on what subsets of natural numbers (or other famous countable domains) could be defined effectively and how

Source URL: www.comp.nus.edu.sg

• Mathematics
• Mathematical logic
• Recursively enumerable set
• Primitive recursive function
• Recursion
• Diophantine set
• Μ operator
• Computability
• Recursive set
• Computability theory
• Theoretical computer science
• Theory of computation